Decomposition Theorems for Probabilistic Automata over Infinite Objects
نویسنده
چکیده
A probabilistic Büchi automaton PBA is defined. The probabilistic language (L, p) as defined by the PBA is defined. A decomposition theorem similar to the classical Krohn-Rhodes theorem, but for PBA is proved.
منابع مشابه
Solving infinite system of nonlinear integral equations by using F-generalized Meir-Keeler condensing operators, measure of noncompactness and modified homotopy perturbation.
In this article to prove existence of solution of infinite system of nonlinear integral equations, we consider the space of solution containing all convergence sequences with a finite limit, as with a suitable norm is a Banach space. By creating a generalization of Meir-Keeler condensing operators which is named as F-generalized Meir-Keeler condensing operators and measure of noncompactness, we...
متن کاملProbabilistic Deterministic Infinite Automata
We propose a novel Bayesian nonparametric approach to learning with probabilistic deterministic finite automata (PDFA). We define a PDFA with an infinite number of states (probabilistic deterministic infinite automata, or PDIA) and show how to average over its connectivity structure and state-specific emission distributions. Given a finite training sequence, posterior inference in the PDIA can ...
متن کاملInfinite Synchronizing Words for Probabilistic Automata
Probabilistic automata are finite-state automata where the transitions are chosen according to fixed probability distributions. We consider a semantics where on an input word the automaton produces a sequence of probability distributions over states. An infinite word is accepted if the produced sequence is synchronizing, i.e. the sequence of the highest probability in the distributions tends to...
متن کاملThe Decidability Frontier for Probabilistic Automata on Infinite Words
We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limitaverage conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present a complete characterization of the decidability and undecidability frontier of the quantitative ...
متن کاملDecomposition and Composition of Timed Automata
We propose in this paper a decomposition theorem for the timed automata introduced by Alur and Dill 2]. To this purpose, we deene a new simple and natural concatenation operation, indexed by the set of clocks to be reset, on timed automata generalizing the classical untimed concatenation. Then we extend the famous Kleene's and B uchi's theorems on classical untimed automata by simply changing t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Informatica, Lith. Acad. Sci.
دوره 10 شماره
صفحات -
تاریخ انتشار 1999